A Uniied Description of Iterative Algorithms for Traac Equilibria

The purpose of this paper is to provide a uniied description of iterative algorithms for the solution of traac equilibrium problems. We demonstrate that a large number of well known solution techniques can be described in a uniied manner through the concept of partial linearization, and establish close relationships with other algorithmic classes for nonlinear programming and variational inequalities. In the case of nonseparable travel costs, the class of partial linearization algorithms are shown to yield new results in the theory of nite-dimensional variational inequalities. The possibility of applying truncated algorithms within the framework is also discussed.